Cubical 2-complexes with the 8-property Admit a Strongly Convex Metric
نویسنده
چکیده
We study metric conditions implied by a combinatorial curvature condition on a finite cubical 2-complex. Our main result is that any finite, simply connected, cubical 2-complex with the 8-property, admits a strongly convex metric. 2000 Mathematics Subject Classification: 53C21.
منابع مشابه
Hexagonal 2-complexes Have a Strongly Convex Metric
We give two distinct proofs for the fact that any finite simply connected hexagonal 2-complex has a strongly convex metric. In our first proof we show that these complexes are CAT(0) spaces, while the second proof makes use of the fact that finite, simply connected hexagonal 2-complexes are collapsible. Both proofs rely on the fact that hexagonal 2-complexes have the 12-property.
متن کاملComplexes of $C$-projective modules
Inspired by a recent work of Buchweitz and Flenner, we show that, for a semidualizing bimodule $C$, $C$--perfect complexes have the ability to detect when a ring is strongly regular.It is shown that there exists a class of modules which admit minimal resolutions of $C$--projective modules.
متن کاملFilling invariants of systolic complexes and groups
Systolic complexes were introduced in Januszkiewicz–Świa̧tkowski [12] and, independently, in Haglund [10]. They are simply connected simplicial complexes satisfying a certain condition that we call simplicial nonpositive curvature (abbreviated SNPC). The condition is local and purely combinatorial. It neither implies nor is implied by nonpositive curvature for geodesic metrics on complexes, but ...
متن کاملRecognizing Graphs of Acyclic Cubical Complexes
Acyclic cubical complexes have first been introduced by Bandelt and Chepoi in analogy to acyclic simplicial complexes. They characterized them by cube contraction and elimination schemes and showed that the graphs of acyclic cubical complexes are retracts of cubes characterized by certain forbidden convex subgraphs. In this paper we present an algorithm of time complexity O(m log n) which recog...
متن کاملGraphs of Acyclic Cubical Complexes
It is well known that chordal graphs are exactly the graphs of acyclic simplicial complexes . In this note we consider the analogous class of graphs associated with acyclic cubical complexes . These graphs can be characterized among median graphs by forbidden convex subgraphs . They possess a number of properties (in analogy to chordal graphs) not shared by all median graphs . In particular , w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010